Fast Detection of Community Structures using Graph Traversal in Social Networks

Finding community structures in social networks is considered to be a challenging task as many of the proposed algorithms are computationally expensive and does not scale too well for large graphs. Most of the community detection algorithms proposed till date are unsuitable for applications that would require detection of communities in real-time, especially for massive networks. The Louvain method, which uses modularity maximization to detect clusters, is usually considered to be one of the fastest running community detection algorithms even without any provable bound. We propose a novel graph traversal-based community detection framework, which not only runs faster than the Louvain method but also generates clusters of better quality for most of the benchmark datasets. We show that our algorithms run in time O(|V | + |E|) to create an initial cover before using modularity maximization to get the final cover. Keywords— Community Detection, Influenced Neighbor Score, Brokers, Community Nodes, Communities